Composing counterpoint musical scores with variable neighborhood search
نویسنده
چکیده
In this research a variable neighborhood search (VNS) algorithm is developed that can generate musical fragments of arbitrary length. The objective function of the algorithm is based on a quantification of existing fifth species counterpoint rules. A thorough parametric analysis of the VNS reveals the significance of the algorithm’s parameters on the quality of the composed fragment, as well as their optimal settings. The VNS algorithm has been implemented in a user-friendly software environment for composition, called Optimuse.
منابع مشابه
Evolving Musical Counterpoint Initial Report on the Chronopoint Musical Evolution System
Musical counterpoint, a musical technique in which two or more independent melodies are played simultaneously with the goal of creating aesthetically pleasing harmony, has been around since the baroque era. However, to our knowledge computational generation of aesthetically pleasing linear counterpoint based on subjective fitness assessment has not been explored by the evolutionary computation ...
متن کاملEvolving Musical Counterpoint
Musical counterpoint, a musical technique in which two or more independent melodies are played simultaneously with the goal of creating harmony, has been around since the baroque era. However, to our knowledge computational generation of aesthetically pleasing linear counterpoint based on subjective fitness assessment has not been explored by the evolutionary computation community (although gen...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کامل